Families of optimal OOCs with λ = 2
نویسنده
چکیده
We provide a new construction yielding one new and one known infinite family of optimal (n, w, 2)-optical orthogonal codes, w ∈ {4, 6}. Our construction relies on various techniques in finite projective spaces involving hyperovals in projective planes and Singer groups.
منابع مشابه
2-dimensional Optical Orthogonal Codes from Singer Groups
We present several new families of (Λ × T,w, λ) (2-D) wavelength/time optical orthogonal codes (2D-OOCs) with λ = 1, 2. All families presented are either optimal with respect to the Johnson bound (J-optimal) or are asymptotically optimal. The codes presented have more flexible dimensions and weight than the J-optimal families appearing in the literature. The constructions are based on certain p...
متن کاملBounds and constructions for (v, W, 2, Q)-OOCs
In 1996, Yang introduced variable-weight optical orthogonal code for multimedia optical CDMA systemswithmultiple quality of service (QoS) requirements. LetW = {w1, . . . , wr } be an ordering of a set of r integers greater than 1, λ be a positive integer (autoand crosscorrelation parameter), and Q = (q1, . . . , qr ) be an r-tuple (weight distribution sequence) of positive rational numbers whos...
متن کاملOptical Orthogonal Codes from Singer Groups
We construct some new families of optical orthogonal codes that are asymptotically optimal. In particular, for any prescribed value of λ, we construct infinite families of (n, w, λ)-OOCs that in each case are asymptotically optimal. Our constructions rely on various techniques in finite projective spaces involving normal rational curves and Singer groups. These constructions generalize and impr...
متن کاملOptical orthogonal codes and arcs in PG(d, q)
We present a new construction for (n,w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal rational curves. Moreover, our construction yields for each λ > 1 an infinite family of OOCs which are asymptotically optimal (with respect to the Johnson bound).
متن کاملUnified combinatorial constructions of optimal optical orthogonal codes
We present unified constructions of optical orthogonal codes (OOCs) using other combinatorial objects such as cyclic linear codes and frequency hopping sequences. Some of obtained OOCs are optimal or asymptotically optimal with respect to the Johnson bound. Also, we are able to show the existence of new optimal frequency hopping sequences (FHSs) with respect to the Singleton bound from our obse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008